A fast neural-network algorithm for VLSI cell placement
نویسندگان
چکیده
منابع مشابه
A Fast Neural{Network Algorithm for Cell Placement
|Cell placement is an important phase of current VLSI circuit design styles as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) have been successful in solving this problem, they are known to be slow. In this paper, we propose a neural network algorithm that produces solutions as good as SA in substantiall...
متن کاملVLSI Architecture for Neural Network
In this paper a hardware implementation of an artificial neural network on Field Programmable Gate Arrays (FPGA) is presented. For the neural network based instrument prototype in real time application, conventional specific VLSI neural chip design suffers the limitation in time and cost. With the low precision artificial neural network (ANN) design, FPGAs have higher speed and smaller size for...
متن کاملA VLSI Neural Network for Color Constancy
A system for color correction has been designed, built, and tested successfully; the essential components are three custom chips built using subthreshold analog CMOS VLSI. The system, based on Land's Retinex theory of color constancy, produces colors similar in many respects to those produced by the visual system. Resistive grids implemented in analog VLSI perform the smoothing operation centra...
متن کاملVLSI: Techniques for Efficient Standard Cell Placement
In the physical designing of the chip, placement is one of the most important steps in the design flow, this paper gives the basic overview of the placement algorithms being used with shrinking technology node for the automatic placement of cells which gives an optimized design in terms of chip area, speed and cost. Basically the emphasis will be on recent trends of Wire-length driven placement...
متن کاملA Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of move...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Networks
سال: 1998
ISSN: 0893-6080
DOI: 10.1016/s0893-6080(98)00089-6